Qualifying the Expressivity/eeciency Tradeoo: Reformation-based Diagnosis
نویسندگان
چکیده
This paper presents an approach to model-based diagnosis that rst compiles a rst-order system description to a propositional representation, and then solves the diagnostic problem as a linear programming instance. Relevance reasoning is employed to isolate parts of the system that are related to certain observation types and to economically instantiate the theory, while methods from operations research ooer promising results to generate near-optimal diagnoses eeciently.
منابع مشابه
A Terminological Logic with Defaults: A Definition and an Application
In this paper we present a terminological language which includes defaults, and a deenition of default subsumption based on the notion of skeptical inheritance in default reasoning. Except for the inclusion of defaults the language is limited when compared to most terminological logics. However defaults are a necessary construct in many applications and we suggest that the language presented he...
متن کاملExpressive Power of a New Model for Structured Text Databases
This paper studies the expressivity of a new model for structuring and querying textual databases by both the structure and contents of the text. The key idea of the model is a set-oriented query language based on operations on proximal nodes. This model has been shown to be eeciently implementable, and the aim of this paper is to show that it is competitive in expressivity with models whose im...
متن کاملEecient Communication-storage Tradeoos for Multicast Encryption
We consider re-keying protocols for secure multicasting in a dynamic multicast group with a center. There is a variety of diierent scenarios using multicast, presenting a wide range of eeciency requirements with respect to several parameters. We give an upper bound on the tradeoo between storage and communication parameters. In particular , we suggest an improvement of the schemes by Wallner et...
متن کاملApproximate Planning for Factored POMDPs using Belief State Simpli cation
We are interested in the problem of planning for factored POMDPs. Building on the recent results of Kearns, Mansour and Ng, we provide a planning algorithm for fac-tored POMDPs that exploits the accuracy-eeciency tradeoo in the belief state simplii-cation introduced by Boyen and Koller.
متن کاملAn Attribute Grammar Based Framework for Machine Dependent Computational Optimizations of Media Processing Algorithms
Media processing algorithms are typically computation intensive, and in complexity constrained environments, nd-ing the most computational eecient algorithm is critical. In this paper, we present an attribute grammar based framework , which captures the computational complexity of an algorithm in a machine dependent manner. Using this formalism , computational optimality can be deened; a media ...
متن کامل